The journey of the union-closed sets conjecture
نویسندگان
چکیده
We survey the state of the union-closed sets conjecture.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملNote on the Union-Closed Sets Conjecture
The union-closed sets conjecture states that if a finite family of sets A 6 = {∅} is union-closed, then there is an element which belongs to at least half the sets in A. In 2001, D. Reimer showed that the average set size of a union-closed family, A, is at least 1 2 log2 |A|. In order to do so, he showed that all union-closed families satisfy a particular condition, which in turn implies the pr...
متن کاملDecomposition of supra soft locally closed sets and supra SLC-continuity
In this paper, we introduce two different notions of generalized supra soft sets namely supra A--soft sets and supra soft locally closed sets in supra soft topological spaces, which are weak forms of supra open soft sets and discuss their relationships with each other and other supra open soft sets [{it International Journal of Mathematical Trends and Technology} (IJMTT), (2014) Vol. 9 (1):37--...
متن کاملUnion Closed Set Conjecture and Maximum Dicut in Connected Digraph
In this dissertation, we study the following two topics, i.e., the union closed set conjecture and the maximum edges cut in connected digraphs. The union-closed-set-conjecture-topic goes as follows. A finite family of finite sets is union closed if it contains the union of any two sets in it. Let XF = ∪F∈FF . A union closed family of sets is separating if for any two distinct elements in F , th...
متن کاملNew Conjectures for Union-Closed Families
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead prove that 2a is an upper bound to the number of sets in a union-closed family on a ground set of n elements where each element is in at most a sets for all a, n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015